package com.it.data_tree.tree.binaryTree;

public class Node {
    private int no;
    private Node left;
    private Node right;


    public Node(int no) {
        this.no = no;
    }

    public Node(int no, Node left, Node right) {
        this.no = no;
        this.left = left;
        this.right = right;
    }

    public int getNo() {
        return no;
    }

    public void setNo(int no) {
        this.no = no;
    }

    public Node getLeft() {
        return left;
    }

    public void setLeft(Node left) {
        this.left = left;
    }

    public Node getRight() {
        return right;
    }

    public void setRight(Node right) {
        this.right = right;
    }

    @Override
    public String
    toString() {
        return String.valueOf(this.no);
    }
}
